Thesis Proposal: An Application of Game Characterizations to Propositional Proof Complexity
نویسنده
چکیده
Since then, our Dangerous Reductions research [HHU07] was accepted at the SAT 2007 conference in Lisbon. In light of Pavel Hrubes’ recent impressive Intuitionistic Logic lower bounds [Hru06], we are currently in the process of reworking our Intuitionistic Logic paper, which needs to be modified to take the new results into account. In unrelated research, [HHM07] was recently accepted by the Notre Dame Journal of Formal Logic.
منابع مشابه
Applications of Games to Propositional Proof Complexity
Applications of Games to Propositional Proof Complexity Alexander Hertel Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2008 In this thesis we explore a number of ways in which combinatorial games can be used to help prove results in the area of propositional proof complexity. The results in this thesis can be divided into two sets, the first being dedicated ...
متن کاملRevised Research Proposal or Preliminary Thesis Proposal
The broad relevance and importance of bounded arithmetic and propositional proof complexity are well appreciated; these subjects are two of three which are interconnected in various and interesting ways, the third subject being computational complexity theory. This latter area is rife with old, well-established open problems and one good way to get at them is by studying the other two, whose pr...
متن کاملILLC PhD Pilot Study
This is a proposal for a thesis in the interface of descriptive set theory and computable analysis, in a continuation of my MoL thesis [9]. There, I was interested in studying connections between game characterizations of classes of functions in descriptive set theory and the theory of Weihrauch reducibility, in particular searching for counterparts in computable analysis to the game characteri...
متن کاملGame Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space needed to compute them. As a proof system, Tree Resolution forms the underpinnings of all DPLL-based SAT solvers, so it is of interest not only to proof complexity researchers, but also to those in the area of proposit...
متن کاملBoolean games revisited1
Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players’ utility functions are binary and described by a single propositional formula, and the strategies available to a player consist of truth assignments to each of a given set of propositional variables (the variables controlled by th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007